COCM: Co-Occurrence-Based Consistency Matching in Domain-Adaptive Segmentation

نویسندگان

چکیده

This paper focuses on domain adaptation in a semantic segmentation task. Traditional methods regard the source and target as whole, image matching is determined by random seeds, leading to low degree of consistency between domains interfering with reduction gap. Therefore, we designed two-step, three-level cascaded strategy—co-occurrence-based (COCM)—in which two steps are: Step 1, design strategy from perspective category existence filter sub-image set highest whole domain, 2, which, spatial existence, propose method measuring PIOU score quantitatively evaluate co-occurring categories select best-matching image. The three levels mean that order improve importance low-frequency process, divide into according frequency co-occurrences domains; these are head, middle, tail levels, priority given categories. proposed COCM maximizes category-level has been proven be effective reducing gap while being lightweight. experimental results general datasets can compared those state-of-the-art (SOTA) methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Co-Occurrence-Based Error Correction Approach to Word Segmentation

To overcome the problems in Thai word segmentation, a number of word segmentation has been proposed during the long period of time until today. We propose a novel Thai word segmentation approach so called Co-occurrence-Based Error Correction (CBEC). CBEC generates all possible segmentation candidates using the classical maximal matching algorithm and then selects the most accurate segmentation ...

متن کامل

Adaptive Approximate Record Matching

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

متن کامل

Maintaining Arc Consistency using Adaptive Domain Ordering

Solving a Constraint Satisfaction Problem (CSP) by Maintaining Arc Consistency (MAC) [Sabin and Freuder, 1994] has been one of the most widely-used methods. Since Arc Consistency (AC) is enforced at every node in a search tree, its efficiency is critical to the whole algorithm. We propose a new MAC algorithm based on AC-3.1 [Zhang and Yap, 2001] in which the AC component is capable of starting ...

متن کامل

Adaptive image matching in the subband domain

In this paper we discuss image matching by correlation in the subband domain with prospective applications. Theoretical proof is given to show that the correlation of two signals equals the weighted sum of the correlations of their decomposed subband signals. We propose an adaptive method to compute image correlation directly in the subband domain, which avoids decoding of the compressed data. ...

متن کامل

Local Stereo Matching Using Adaptive Local Segmentation

We propose a new dense local stereo matching framework for gray-level images based on an adaptive local segmentation using a dynamic threshold. We define a new validity domain of the fronto-parallel assumption based on the local intensity variations in the 4-neighborhood of the matching pixel. The preprocessing step smoothes low textured areas and sharpens texture edges, whereas the postprocess...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2022

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math10234468